A Probabilistic Characterization of Worker Allocations that Minimize Lmax in a Job Shop
نویسندگان
چکیده
that Minimize Lmax in a Job Shop Benjamin J. Lobo Edward P. Fitts Department of Industrial and Systems Engineering, North Carolina State University, Campus Box 7906, Raleigh, NC 27695-7906, USA, {[email protected]} Kristin A. Thoney Department of Textile and Apparel, Technology and Management, North Carolina State University, Campus Box 8301, Raleigh, NC 27695-8301, USA, {[email protected]} Thom J. Hodgson, Russell E. King, James R. Wilson Edward P. Fitts Department of Industrial and Systems Engineering, North Carolina State University, Campus Box 7906, Raleigh, NC 27695-7906, USA, {[email protected], [email protected], [email protected]}
منابع مشابه
An effective lower bound on Lmax in a worker-constrained job shop
A common industrial operation is a dual resource constrained job shop where: (a) the objective is to minimize Lmax, the maximum job lateness; (b) machines are organized into groups; and (c) each worker is assigned to a specific machine group. Because this problem is NP-hard, finding optimal solutions by enumeration is impractical. This paper details a procedure to compute a lower bound on Lmax ...
متن کاملA Probabilistic Characterization of Allocation Performance in a Worker-Constrained Job Shop
We analyze a dual resource constrained (DRC) job shop in which both machines and workers are limited, and we seek to minimize Lmax, the maximum job lateness. An allocation of workers to machine groups is required to generate a schedule, and determining a schedule that minimizes Lmax is NP-hard. This chapter details a probabilistic method for evaluating the quality of a specific (but arbitrary) ...
متن کاملAllocating job-shop manpower to minimize LMAX: Optimality criteria, search heuristics, and probabilistic quality metrics
We address questions raised by Lobo et al. in 2012 regarding the NP-hard problem of finding an optimal allocation of workers to machine groups in a job shop so as to minimize Lmax, the maximum job lateness. Lobo et al. formulated a lower bound on Lmax given a worker allocation, and an algorithm to find an allocation yielding the smallest such lower bound. In this article we establish optimality...
متن کاملMaximizing service level in a β-robust job shop scheduling model
In the realm of scheduling problems, different sources of uncertainty such as probabilistic durations of jobs or stochastic breakdowns of machines can arise. Given this, one highly desirable characteristic of an intelligent schedule is to bring better punctuality with less efficiency-loss because a dominant factor in customer appreciation is punctuality. It is also one of the most intangible to...
متن کاملOn solving the classic job shop makespan problem by minimizing Lmax
In this paper, the classic job shop scheduling problem of minimizing makespan, J//Cmax, is studied. A heuristic approach is presented for solving the J//Lmax problem using an iterative deterministic simulation technique combined with simulated annealing. A simple transformation is provided for converting a J//Cmax problem to an equivalent J//Lmax problem. The approach is tested on some well-kno...
متن کامل